Solving the Quintic by Iteration in Three Dimensions

نویسنده

  • Scott Crass
چکیده

The requirement for solving a polynomial is a means of breaking its symmetry, which in the case of the quintic, is that of the symmetric group S5. Induced by its five-dimensional linear permutation representation is a three-dimensional projective action. A mapping of complex projective 3-space with this S5 symmetry can provide the requisite symmetry-breaking tool. The article describes some of the S5 geometry in CP 3 as well as several maps with particularly elegant geometric and dynamical properties. Using a rational map in degree six, it culminates with an explicit algorithm for solving a general quintic. In contrast to the Doyle-McMullen procedure—three 1-dimensional iterations, the present solution employs one 3-dimensional iteration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the sextic by iteration: A complex dynamical approach

Recently, P. Doyle and C. McMullen devised an iterative solution to the fifth degree polynomial [4]. At the method’s core is a rational mapping f of CP with the icosahedral (A5) symmetry of a general quintic. Moreover, this A5-equivariant posseses nice dynamics: for almost any initial point a0 ∈ CP, the sequence of iterates f(a0) converges to one of the periodic cycles that comprise an icosahed...

متن کامل

Solving the Sextic by Iteration: A Study in Complex Geometry and Dynamics

Recently, [Doyle and McMullen 1989] devised an iterative solution to the fifth degree polynomial. At the method’s core is a rational mapping f of CP with the icosahedral symmetry of a general quintic. Algebraically, this means that f commutes with a group of Möbius transformations that is isomorphic to the alternating groupA5. Moreover, thisA5-equivariant posseses nice dynamics: for almost any ...

متن کامل

Stationary One Point Iteration Algorithm of Arbitrary Order of Convergence for Solving the Distance Equation

Stationary One Point Iteration Algorithm of Arbitrary Order of Convergence for Solving the Distance Equation M. A. Sharaf Department of Astronomy, Faculty of Science, King Abdul Aziz University ,Jeddah, Saudi Arabia Abstract. In the present paper, stationary one point iteration algorithm of arbitrary order convergence for solving transcendental equations was given and applied with quintic orde...

متن کامل

Solving the quintic by iteration

Equations that can be solved using iterated rational maps are characterized: an equation is ‘computable’ if and only if its Galois group is within A5 of solvable. We give explicitly a new solution to the quintic polynomial, in which the transcendental inversion of the icosahedral map (due to Hermite and Kronecker) is replaced by a purely iterative algorithm. The algorithm requires a rational ma...

متن کامل

Solving time-fractional chemical engineering equations by modified variational iteration method as fixed point iteration method

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2001